#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const int maxn = 1000 + 1;
char is_prime[maxn];
ll primes[maxn], k = 0;
ll n;
void fill() {//O(n)
    for(ll i = 2; i <= n; i++)is_prime[i] = 1;
    for(ll i = 2; i  <= n / i; i++)if(is_prime[i])for(int j = 2 * i; j <= n; j += i)is_prime[j] = 0;
    for(ll i = 0; i <= n; i++)	if(is_prime[i])primes[k++] = i;

}
int main() {
    cin >> n;
    fill();
    ll tot = 1;
    for(int i = 0; i < k; i++) {
        ll p = primes[i];
        ll j = 0;
        for(ll t = p; t <= n; t *= p) {
            j += n / t;
        }
        tot = tot * (j + 1);
    }
    cout << tot << endl;
    return 0;
}